package cn.wolfcode.luowowo.query;

import lombok.Getter;

import java.util.HashMap;
import java.util.Map;

@Getter
public class TravelCondition {

     // 出行天数
    public static final Map<Integer,TravelCondition> Data_Map = new HashMap<>();
    public static final Map<Integer,TravelCondition> PerexPend_Map = new HashMap<>();
    // 静态框
    static {
        Data_Map.put(1,new TravelCondition(0,3));
        Data_Map.put(2,new TravelCondition(4,7));
        Data_Map.put(3,new TravelCondition(8,14));
        Data_Map.put(4,new TravelCondition(15,Integer.MAX_VALUE));
    }


    static {
        PerexPend_Map.put(1,new TravelCondition(1,999));
        PerexPend_Map.put(2,new TravelCondition(1000,6000));
        PerexPend_Map.put(3,new TravelCondition(6001,20000));
        PerexPend_Map.put(4,new TravelCondition(20001,Integer.MAX_VALUE));
    }


    private int min; // 最小
    private int max; // 最大



    public TravelCondition(int min ,int max){
        this.min = min;
        this.max = max;
    }
}
